An open reading frame upstream from the nifH gene of Klebsiella pneumoniae

An open reading frame upstream from nifHDK operon of Klebsiella pneumoniae had been described. The orientation of this open reading frame is opposite to that of nifHDK and sequence homology was found between the open reading frame promoter and the promoter of nifHDK operon. A recombinant plasmid carrying the promoter region of the open reading frame fused to the beta-galactosidase gene was constructed. Strains of E.coli were transformed with the plasmid containing this open reading frame promoter-lacZ fusion or co-transformed with it and a plasmid carrying the nifA gene. An appreciable activity of beta-galactosidase was found in strains which received both plasmids, indicating that the promoter of the open reading frame can be activated by the product of nifA gene. Thus, the open reading frame found between nifHDK operon and nifJ behaves just like other nif genes of K.pneumoniae in requiring the product of nifA as the positive effector for expression

Tension fracture behaviors of welded joints in X70 steel pipeline

AbstractThe surface of welded joints in X70 steel pipeline was processed by laser shock wave, its mechanical behaviors of tension fracture were analyzed with tension test, and the fracture morphologies and the distributions of chemical element were observed with scanning electron microscope and energy dispersive spectrum, respectively. The experimental results show that the phenomenon of grain refinement occurs in the surface of welded joints in X70 steel pipeline after the laser shock processing, and compressive residual stress is formed in its surface strengthened layer. There is no yield stage but a continuous yield behavior in the welded joints in X70 steel pipeline after the laser shock processing, and its extensibility has decreased by 20 %. The welded joints in X70 steel pipeline in primitive state exhibits brittle fracture with less tearing edges, while the fracture of welded joints in X70 steel pipeline processed by laser shock is ductile fracture with a lot of tearing edges

On tree-preserving constraints

© Springer International Publishing Switzerland 2015. Tree convex constraints are extensions of the well-known row convex constraints. Just like the latter, every path-consistent tree convex constraint network is globally consistent. This paper studies and compares three subclasses of tree convex constraints which are called chain-, path- and tree-preserving constraints respectively. While the tractability of the subclass of chain-preserving constraints has been established before, this paper shows that every chain- or path-preserving constraint network is in essence the disjoint union of several independent connected row convex constraint networks, and hence (re-)establish the tractability of these two subclasses of tree convex constraints. We further prove that, when enforcing arc- and path-consistency on a tree-preserving constraint network, in each step, the network remains tree-preserving. This ensures the global consistency of the tree-preserving network if no inconsistency is detected. Moreover, it also guarantees the applicability of the partial path-consistency algorithm to tree-preserving constraint networks, which is usually more efficient than the path-consistency algorithm for large sparse networks. As an application, we show that the class of treepreserving constraints is useful in solving the scene labelling problem

On tree-preserving constraints

© 2017, Springer International Publishing Switzerland. The study of tractable subclasses of constraint satisfaction problems is a central topic in constraint solving. Tree convex constraints are extensions of the well-known row convex constraints. Just like the latter, every path-consistent tree convex constraint network is globally consistent. However, it is NP-complete to decide whether a tree convex constraint network has solutions. This paper studies and compares three subclasses of tree convex constraints, which are called chain-, path-, and tree-preserving constraints respectively. The class of tree-preserving constraints strictly contains the subclasses of path-preserving and arc-consistent chain-preserving constraints. We prove that, when enforcing strong path-consistency on a tree-preserving constraint network, in each step, the network remains tree-preserving. This ensures the global consistency of consistent tree-preserving networks after enforcing strong path-consistency, and also guarantees the applicability of the partial path-consistency algorithms to tree-preserving constraint networks, which is usually much more efficient than the path-consistency algorithms for large sparse constraint networks. As an application, we show that the class of tree-preserving constraints is useful in solving the scene labelling problem